Inheritance of Convexity for the Pmin-Restricted Game
نویسنده
چکیده
We consider restricted games on weighted graphs associated with minimum partitions. We replace in the classical definition of Myerson restricted game the connected components of any subgraph by the subcomponents corresponding to a minimum partition. This minimum partition Pmin is induced by the deletion of the minimum weight edges. We provide a characterization of the graphs satisfying inheritance of convexity from the underlying game to the restricted game associated with Pmin.
منابع مشابه
Inheritance of Convexity for the $\mathcal{P}_{\min}$-Restricted Game
We consider restricted games on weighted graphs associated with minimum partitions. We replace in the classical definition of Myerson restricted game the connected components of any subgraph by the subcomponents corresponding to a minimum partition. This minimum partition Pmin is induced by the deletion of the minimum weight edges. We provide a characterization of the graphs satisfying inherita...
متن کاملComplexity of inheritance of $\mathcal{F}$-convexity for restricted games induced by minimum partitions
LetG = (N,E,w) be a weighted communication graph (with weight function w on E). For every subset A ⊆ N , we delete in the subset E(A) of edges with ends in A, all edges of minimum weight in E(A). Then the connected components of the corresponding induced subgraph constitute a partition of A that we call Pmin(A). For every game (N, v), we define the Pmin-restricted game (N, v) by v(A) =
متن کاملGames induced by the partitioning of a graph
The paper aims at generalizing the notion of restricted game on a communication graph, introduced by Myerson. We consider communication graphs with weighted edges, and we define arbitrary ways of partitioning any subset of a graph, which we call correspondences. A particularly useful way to partition a graph is obtained by computing the strength of the graph. The strength of a graph is a measur...
متن کاملSome existence results for generalized vector quasi-equilibrium problems
In this paper, we introduce and study a class of generalized vector quasi-equilibrium problem, which includes many vector equilibrium problems, equilibrium problems, vector variational inequalities and variational inequalities as special cases. Using one person game theorems, the concept of escaping sequences and without convexity assumptions, we prove some existence results for ...
متن کاملOrdered and Delayed Adversaries and How to Work against Them on Shared Channel
Performance of a distributed algorithm depends on environment in which the algorithm is executed. This is often modeled as a game between the algorithm and a conceptual adversary causing specific distractions. In this work we define a class of ordered adversaries, which cause distractions according to some partial order fixed by the adversary before the execution, and study how they affect perf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1708.02675 شماره
صفحات -
تاریخ انتشار 2017